Spectral form factor in non-Gaussian random matrix theories
نویسندگان
چکیده
منابع مشابه
Spectral Form Factor in a Random Matrix Theory
In the theory of disordered systems the spectral form factor S(τ), the Fourier transform of the two-level correlation function with respect to the difference of energies, is linear for τ < τc and constant for τ > τc. Near zero and near τc its exhibits oscillations which have been discussed in several recent papers. In the problems of mesoscopic fluctuations and quantum chaos a comparison is oft...
متن کاملUniversality of random-matrix results for non-Gaussian ensembles.
We study random-matrix ensembles with a non-Gaussian probability distribution P (H) ∼ exp(−Ntr V (H)) where N is the dimension of the matrix H and V (H) is independent of N . Using Efetov’s supersymmetry formalism, we show that in the limit N → ∞ both energy level correlation functions and correlation functions of S-matrix elements are independent of P (H) and hence universal on the scale of th...
متن کاملGaussian fluctuations for non-Hermitian random matrix ensembles
Consider an ensemble of N ×N non-Hermitian matrices in which all entries are independent identically distributed complex random variables of mean zero and absolute mean-square one. If the entry distributions also possess bounded densities and finite (4 + ε) moments, then Z. D. Bai [Ann. Probab. 25 (1997) 494–529] has shown the ensemble to satisfy the circular law: after scaling by a factor of 1...
متن کاملMatrix measures, random moments and Gaussian ensembles
We consider the moment space Mn corresponding to p × p real or complex matrix measures defined on the interval [0, 1]. The asymptotic properties of the first k components of a uniformly distributed vector (S1,n, . . . , Sn,n) ∗ ∼ U(Mn) are studied if n → ∞. In particular, it is shown that an appropriately centered and standardized version of the vector (S1,n, . . . , Sk,n) ∗ converges weakly to...
متن کاملMatrix Decompositions Using sub-Gaussian Random Matrices
In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review D
سال: 2019
ISSN: 2470-0010,2470-0029
DOI: 10.1103/physrevd.100.026017